Planning texts by constraint satisfaction
نویسنده
چکیده
A method is described by which a rhetoricalstructure tree can be realized by a text structure made up of sections, paragraphs, sentences, vertical lists, and other textual patterns, with discourse connectives added (in the correct positions) to mark rhetorical relations. We show that text-structuring can be formulated as a Constraint Satisfaction Problem, so that all solutions respecting constraints on text-structure formation and structural compatibility can be e ciently generated. Of the many solutions generated by this method, some are stylistically preferable to others; we show how further constraints can be applied in order to select the best versions. Finally, we discuss some extensions such as the generation of indented text structures.
منابع مشابه
ITRI-00-08 An integrated framework for text planning and pronominalisation
This paper describes an implemented system which uses centering theory for planning of coherent texts and choice of referring expressions. We argue that text and sentence planning need to be driven in part by the goal of maintaining referential continuity and thereby facilitating pronoun resolution: obtaining a favourable ordering of clauses, and of arguments within clauses, is likely to increa...
متن کاملOptimizing Referential Coherence in Text Generation
This article describes an implemented system which uses centering theory for planning of coherent texts and choice of referring expressions. We argue that text and sentence planning need to be driven in part by the goal of maintaining referential continuity and thereby facilitating pronoun resolution: Obtaining a favorable ordering of clauses, and of arguments within clauses, is likely to incre...
متن کاملITRI-00-24 Planning texts by constraint satisfaction
A method is described by which a rhetorical-structure tree can be realized by a text structure made up of sections, paragraphs, sentences, vertical lists, and other textual patterns, with discourse connectives added (in the correct positions) to mark rhetorical relations. We show that text-structuring can be formulated as a Constraint Satisfaction Problem , so that all solutions respecting cons...
متن کاملIntroduction to planning, scheduling and constraint satisfaction
Planning, scheduling and constraint satisfaction are important areas in Artificial Intelligence (AI). Many real-world problems are known as AI planning and scheduling problems, where resources must be allocated so as to optimize overall performance objectives. Therefore, solving these problems requires an adequate mixture of planning, scheduling and resource allocation to competing goal activit...
متن کاملReformulating Constraint Models for Classical Planning
Constraint satisfaction techniques are commonly used for solving scheduling problems, still they are rare in AI planning. Although there are several attempts to apply constraint satisfaction for solving AI planning problems, these techniques never became predominant in planning; and they never reached the success of, for example, SATbased planners. In this paper we argue that existing constrain...
متن کامل